Mutable Lists and Call-by-reference in Equational Logic

As the interest for formal methods grows within industry, the need for convenient and automated tools grows too. SOSSubC is an attempt to help the development of certified programs. It allows formal reasoning about imperative programs by translating programs written in SubC, a simple imperative language, into equations. Programs are then axioms of a logical system within which proofs can be carried out. In this paper, we add to the SubC language two important imperative features: mutable lists and call-byreference passing mode. We present their implementation and semantics in SubC, as well as their translation into conditional equations by the SOSSubC system.